DEL Planning and Some Tractable Cases
نویسندگان
چکیده
We describe the planning problem within the framework of dynamic epistemic logic (DEL), considering the tree of sequences of events as the underlying structure. In general, the DEL planning problem is computationally difficult to solve. On the other hand, a great deal of fruitful technical advances have led to deep insights into the way DEL works, and these can be exploited in special cases. We present a few properties that will lead to considerable simplifications of the DEL planning problem and apply them in a toy example.
منابع مشابه
Complexity Results for Planning
I describe several computational complexity results for planning, some of which identify tractable planning problems. The model of planning, called "propositional planning," is simple—conditions within operators are literals with no variables allowed. The different plan ning problems are defined by different restrictions on the preconditions and postconditions of operators. The main results ar...
متن کاملTractable Classes of a Problem of Finding Supporting Actions for a Goal in AI Planning
We are studying tractable classes of a problem of finding supporting actions for a goal using projection global consistency. The projection consistency is a recent technique designed to prune the search space along the search for supports for a sub-goal in AI planning context. The problem of finding supporting actions for a sub-goal (briefly supports problem) is exactly what the GraphPlan plann...
متن کاملOn some tractable classes in deduction and abduction
We address the identification of propositional theories for which entailment is tractable, so that every query about logical consequences of the theory can be answered in polynomial time. We map tractable satisfiability classes to tractable entailment classes, including hierarchies of tractable problems; and show that some initially promising conditions for tractability of entailment, proposed ...
متن کاملEquivalence and Tractability Results for SAS+ Planning
We deene the SAS + planning formalism, which generalizes the previously presented SAS formalism. The SAS + formalism is compared with some better-known propositional-planning formalisms with respect to expres-siveness. Contrary to intuition, all formalisms turn out to be equally expressive in a very strong sense. We further present the SAS +-PUS planning problem which generalizes the previously...
متن کاملRed-Black Planning: A New Tractability Analysis and Heuristic Function
Red-black planning is a recent approach to partial delete relaxation, where red variables take the relaxed semantics (accumulating their values), while black variables take the regular semantics. Practical heuristic functions can be generated from tractable sub-classes of red-black planning. Prior work has identified such sub-classes based on the black causal graph, i. e., the projection of the...
متن کامل